Restarting algorithms for simulation problems with discontinuities
نویسندگان
چکیده
Modelica’s language support includes so-called events for describing discontinuities. Modern integrating environments, like Assimulo, provide elaborate event detection and event handling methods. In addition, the overall performance of a simulation of models with discontinuities (hybrid models) depends strongly on the methods for restarting the integration after an event detection. The present paper reviews two restarting methods for multistep methods, both based on Runge– Kutta starters, and presents preliminary first experiments with Assimulo and LSODAR as a proof of concept, which motivates to apply the technique to hybrid systems described in Modelica and simulated by JModelica.org/PyFMI and Assimulo [1, 3, 2].
منابع مشابه
Recentering, reanchoring & restarting an evolutionary algorithm
Recentering-restarting evolutionary algorithms have been used successfully to evolve epidemic networks. This study develops multiple variations of this algorithm for the purpose of evaluating its use for ordered-gene problems. These variations are called recentering or reanchoring-restarting evolutionary algorithms. Two different adaptive representations were explored that both use generating s...
متن کاملOn Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
The stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential. Here we present a construction that yields an equivalent NFA of size 2 from a stateless deterministic ordered restarting automaton that works on a...
متن کاملWater hammer simulation by explicit central finite difference methods in staggered grids
Four explicit finite difference schemes, including Lax-Friedrichs, Nessyahu-Tadmor, Lax-Wendroff and Lax-Wendroff with a nonlinear filter are applied to solve water hammer equations. The schemes solve the equations in a reservoir-pipe-valve with an instantaneous and gradual closure of the valve boundary. The computational results are compared with those of the method of characteristics (MOC), a...
متن کاملEstimation of LOS Rates for Target Tracking Problems using EKF and UKF Algorithms- a Comparative Study
One of the most important problem in target tracking is Line Of Sight (LOS) rate estimation for using from PN (proportional navigation) guidance law. This paper deals on estimation of position and LOS rates of target with respect to the pursuer from available noisy RF seeker and tracker measurements. Due to many important for exact estimation on tracking problems must target position and Line O...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کامل